The hopping discrete fractional Fourier transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The discrete fractional Fourier transform

We propose and consolidate a definition of the discrete fractional Fourier transform that generalizes the discrete Fourier transform (DFT) in the same sense that the continuous fractional Fourier transform generalizes the continuous ordinary Fourier transform. This definition is based on a particular set of eigenvectors of the DFT matrix, which constitutes the discrete counterpart of the set of...

متن کامل

Two dimensional discrete fractional Fourier transform

Fractional Fourier transform (FRFT) performs a rotation of signals in the time—frequency plane, and it has many theories and applications in time-varying signal analysis. Because of the importance of fractional Fourier transform, the implementation of discrete fractional Fourier transform will be an important issue. Recently, a discrete fractional Fourier transform (DFRFT) with discrete Hermite...

متن کامل

The discrete fractional Fourier transform based on the DFT matrix

We introduce a new discrete fractional Fourier transform (DFrFT) based on only the DFT matrix and its powers. Eigenvectors of the DFT matrix are obtained in a simple-yetelegant and straightforward manner. We show that this DFrFT definition based on the eigentransforms of the DFT matrix mimics the properties of continuous fractional Fourier transform (FrFT) by approximating the samples of the co...

متن کامل

A method for the discrete fractional Fourier transform computation

A new method for the discrete fractional Fourier transform (DFRFT) computation is given in this paper. With the help of this method, the DFRFT of any angle can be computed by a weighted summation of the DFRFTs with the special angles.

متن کامل

On the Grunbaum Commutor Based Discrete Fractional Fourier Transform

The basis functions of the continuous fractional Fourier transform (FRFT) are linear chirp signals that are suitable for time-frequency analysis of signals with chirping timefrequency content. Efforts to develop a discrete computable version of the fractional Fourier transform (DFRFT) have focussed on furnishing a orthogonal set of eigenvectors for the DFT that serve as discrete versions of the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Signal Processing

سال: 2021

ISSN: 0165-1684

DOI: 10.1016/j.sigpro.2020.107763